A Double Sigmoid-Based Beamforming Algorithm with Reduced Computational Complexity
نویسندگان
چکیده
منابع مشابه
A minimum interference routing algorithm with reduced computational complexity
Minimum Interference Routing algorithms are designed to reduce rejections of future requests for the establishment of Label Switched Paths (LSPs) but make no assumption about specific patterns of arrival request. This paper introduces a novel minimum interference routing algorithm, Light Minimum Interference Routing (LMIR), which is based on a new approach to the identification of critical link...
متن کاملLow-Complexity Reduced-Rank Beamforming Algorithms
A reduced-rank framework with set-membership filtering (SMF) techniques is presented for adaptive beamforming problems encountered in radar systems. We develop and analyze stochastic gradient (SG) and recursive least squares (RLS)-type adaptive algorithms, which achieve an enhanced convergence and tracking performance with low computational cost as compared to existing techniques. Simulations s...
متن کاملON FUZZY NEIGHBORHOOD BASED CLUSTERING ALGORITHM WITH LOW COMPLEXITY
The main purpose of this paper is to achieve improvement in thespeed of Fuzzy Joint Points (FJP) algorithm. Since FJP approach is a basisfor fuzzy neighborhood based clustering algorithms such as Noise-Robust FJP(NRFJP) and Fuzzy Neighborhood DBSCAN (FN-DBSCAN), improving FJPalgorithm would an important achievement in terms of these FJP-based meth-ods. Although FJP has many advantages such as r...
متن کاملTruncated Turbo Decoding with Reduced Computational Complexity
The concept of concatenated codes and turbo decoding is well known and leads to a remarkable good performance in many applications. The resulting signal processing for this concept shows high complexity relative to conventional viterbi decoding. Therefore, this paper considers an alternative concept of turbo decoding to reduce the computational complexity. In this case, those sections of the se...
متن کاملAsynchronous Computational VSS with Reduced Communication Complexity
Verifiable secret sharing (VSS) is a vital primitive in secure distributed computing. It allows an untrusted dealer to verifiably share a secret among n parties in the presence of an adversary controlling at most t of them. VSS in the synchronous communication model has received tremendous attention in the cryptographic research community. Nevertheless, recent interest in deploying secure distr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Communication and Information Systems
سال: 2019
ISSN: 1980-6604,1980-6604
DOI: 10.14209/jcis.2019.13